Semantic technologies for open interaction systems

Open interaction systems play a crucial role in agreement technologies because they are software devised for enabling autonomous agents (software or human) to interact, negotiate, collaborate, and coordinate their activities in order to establish agreements and manage their execution. Following the approach proposed by the recent literature on agent environments those open distributed systems can be efficiently and effectively modeled as a set of correlated physical and institutional spaces of interaction where objects and agents are situated. In our view in distributed open systems, spaces are fundamental for modeling the fact that events, actions, and social concepts (like norms and institutional objects) should be perceivable only by the agents situated in the spaces where they happen or where they are situated. Institutional spaces are also crucial for their active functional role of keeping track of the state of the interaction, and for monitoring and enforcing norms. Given that in an open distributed and dynamic system it is fundamental to be able to create and destroy spaces of interaction at run-time, in this paper we propose to create them using Artificial Institutions (AIs) specified at design time. This dynamic creation is a complex task that deserves to be studied in all details. For doing that, in this paper, we will first define the various components of AIs and spaces using Semantic Web Technologies, then we will describe the mechanisms for using AIs specification for realizing spaces of interaction. We will exemplify this process by formalizing the components of the auction Artificial Institution and of the spaces created for running concrete auctions.     

Efficient audio-driven multimedia indexing through similarity-based speech / music discrimination

In this paper, an audio-driven algorithm for the detection of speech and music events in multimedia content is introduced. The proposed approach is based on the hypothesis that short-time frame-level discrimination performance can be enhanced by identifying transition points between longer, semantically homogeneous segments of audio. In this context, a two-step segmentation approach is employed in order to initially identify transition points between the homogeneous regions and subsequently classify the derived segments using a supervised binary classifier. The transition point detection mechanism is based on the analysis and composition of multiple self-similarity matrices, generated using different audio feature sets. The implemented technique aims at discriminating events focusing on transition point detection with high temporal resolution, a target that is also reflected in the adopted assessment methodology. Thereafter, multimedia indexing can be efficiently deployed (for both audio and video sequences), incorporating the processes of high resolution temporal segmentation and semantic annotation extraction. The system is evaluated against three publicly available datasets and experimental results are presented in comparison with existing implementations. The proposed algorithm is provided as an open source software package in order to support reproducible research and encourage collaboration in the field.     

Approximation algorithms for the arc orienteering problem

In this article we present approximation algorithms for the Arc Orienteering Problem (AOP). We propose a polylogarithmic approximation algorithm in directed graphs, while in undirected graphs we give a (6+?+o(1))$(6+?+o(1))$ and a (4+?)$(4+?)$-approximation algorithm for arbitrary instances and instances of unit profit, respectively. Also, an inapproximability result for the AOP is obtained as well as approximation algorithms for the Mixed Orienteering Problem.     

JAID: An algorithm for data fusion and jamming avoidance on distributed sensor networks

Mobile Agent (MA) technology has been recently proposed in Wireless Sensor Networks (WSNs) literature to answer the scalability problem of client/server model in data fusion applications. In this paper, we describe the critical role MAs can play in the field of security and robustness of a WSN in addition to data fusion. The design objective of our Jamming Avoidance Itinerary Design (JAID) algorithm is twofold: (a) to calculate near-optimal routes for MAs that incrementally fuse the data as they visit the nodes; (b) in the face of jamming attacks against the WSN, to modify the itineraries of the MAs to bypass the jammed area(s) while not disrupting the efficient data dissemination from working sensors. If the number of jammed nodes is small, JAID only modifies the pre-jamming scheduled itineraries to increase the algorithm’s promptness. Otherwise, JAID re-constructs the agent itineraries excluding the jammed area(s). Another important feature of JAID is the suppression of data taken from sensors when the associated successive readings do not vary significantly. Data suppression also occurs when sensors’ readings are identical to those of their neighboring sensors. Simulation results confirm that JAID enables retrieval of information from the working sensors of partially jammed WSNs and verifies its performance gain over alternative approaches in data fusion tasks.     

Pixel History Linear Models for Real‐Time Temporal Filtering

We propose a new real‐time temporal filtering and antialiasing (AA) method for rasterization graphics pipelines. Our method is based on Pixel History Linear Models (PHLM), a new concept for modeling the history of pixel shading values over time using linear models. Based on PHLM, our method can predict per‐pixel variations of the shading function between consecutive frames. This combines temporal reprojection with per‐pixel shading predictions in order to provide temporally coherent shading, even in the presence of very noisy input images. Our method can address both spatial and temporal aliasing problems under a unique filtering framework that minimizes filtering error through a recursive least squares algorithm. We demonstrate our method working with a commercial deferred shading engine for rasterization and with our own OpenGL deferred shading renderer. We have implemented our method in GPU and it has shown significant reduction of temporal flicker in very challenging scenarios including foliage rendering, complex non‐linear camera motions, dynamic lighting, reflections, shadows and fine geometric details. Our approach, based on PHLM, avoids the creation of visible ghosting artifacts and it reduces the filtering overblur characteristic of temporal deflickering methods. At the same time, the results are comparable to state‐of‐the‐art real‐time filters in terms of temporal coherence.     

A low-complexity global approximation-free control scheme with prescribed performance for unknown pure feedback systems

A universal, approximation-free state feedback control scheme is designed for unknown pure feedback systems, capable of guaranteeing, for any initial system condition, output tracking with prescribed performance and bounded closed loop signals. By prescribed performance, it is meant that the output error converges to a predefined arbitrarily small residual set, with convergence rate no less than a certain prespecified value, having maximum overshoot less than a preassigned level. The proposed state feedback controller isolates the aforementioned output performance characteristics from control gains selection and exhibits strong robustness against model uncertainties, while completely avoiding the explosion of complexity issue raised by backstepping-like approaches that are typically employed to the control of pure feedback systems. In this respect, a low complexity design is achieved. Moreover, the controllability assumptions reported in the relevant literature are further relaxed, thus enlarging the class of pure feedback systems that can be considered. Finally, simulation studies clarify and verify the approach.     

Using intelligent clustering techniques to classify the energy performance of school buildings

The present paper deals with the energy performance, energy classification and rating and the global environmental quality of school buildings. A new energy classification technique based on intelligent clustering methodologies is proposed. Energy rating of school buildings provides specific information on their energy consumption and efficiency relative to the other buildings of similar nature and permits a better planning of interventions to improve its energy performance. The overall work reported in the present paper, is carried out in three phases. During the first phase energy consumption data have been collected through energy surveys performed in 320 schools in Greece. In the second phase an innovative energy rating scheme based on fuzzy clustering techniques has been developed, while in the third phase, 10 schools have been selected and detailed measurements of their energy efficiency and performance as well as of the global environmental quality have been performed using a specific experimental protocol. The proposed energy rating method has been applied while the main environmental and energy problems have been identified. The potential for energy and environmental improvements has been assessed.     

Mobile agents-based data aggregation in WSNs: benchmarking itinerary planning approaches

Data aggregation represents one of the most challenging and well-studied subjects in the Wireless Sensor Networks (WSN) literature. The energy constraints of sensor nodes call for energy-efficient data aggregation methods so as to prolong network lifetime. Among other approaches, Mobile Agents (MAs) have been proposed to improve the performance of data aggregation in WSNs. In such approaches, the itineraries followed by travelling agents largely determine the overall performance of the data aggregation tasks. Along this line, several heuristics have been proposed to perform efficient itinerary planning for MAs. However, a direct comparison of the proposed algorithms is not straightforward, as they are typically performed on the ground of different parameter instances and assumptions about the underlying network and nodes capabilities. This article provides a critical review and qualitative evaluation of the most prominent itinerary planning algorithms. More importantly, having implemented and simulated a set of eleven (11) itinerary planning algorithms, we compare their performance upon a common parameter space, making realistic network-level assumptions.